Difference families with applications to resolvable designs
نویسندگان
چکیده
Some block disjoint difference families are constructed in rings with the property that there are k distinct units uit 0 < i < k — 1, such that differences ut — Uj (0 < i < j < k — 1) are all units. These constructions are utilized to produce a large number of classes of resolvable block designs.
منابع مشابه
Constructing 1-rotational NRDFs through an Optimization Approach: New (46,9,8), (51,10,9) and (55,9,8)-NRBDs
In this paper we formulate the problem of constructing 1-rotational near resolvable difference families as a combinatorial optimization problem where a global optimum corresponds to a desired difference family. Then, we develop an algorithm based on scatter search in conjunction with a tabu search to construct many of these difference families. In particular, we construct three new near resolva...
متن کاملClass-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds. We present some general constructions including a novel construction for shrinking the index of a master de...
متن کاملComplete Sets of Disjoint Difference Families and their Applications
Let G be an abelian group. A collection of (G, k, λ) disjoint difference families, {F0,F1, · · · ,Fs−1}, is a complete set of disjoint difference families if ∪0≤i≤s−1∪B∈FiB form a partition of G− {0}. In this paper, several construction methods are provided for complete sets of disjoint difference families. Applications to one-factorizations of complete graphs and to cyclically resolvable cycli...
متن کاملA Method for Classification of Doubly Resolvable Designs and Its Application
The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property—they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications. Therefore the classification of doubly resol...
متن کاملUniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four
Each parallel class of a uniformly resolvable design (URD) contains blocks of only one block size. AURDwith v points andwith block sizes three and fourmeans that at least one parallel class has block size three and at least one has block size four. Danziger [P. Danziger, Uniform restricted resolvable designs with r = 3, ARS Combin. 46 (1997) 161–176] proved that for all v ≡ 12 (mod 24) there ex...
متن کامل